On coloured constant composition designs

On constant-composition codes over Zq

A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In this correspondence, we give a lower bound for the maximum size of the -ary constant-composition codes with minimum distance at least 3. This bound is asymptotically optimal and generalizes the Graham–Sloane bound for binary constant-wei...

Kalmar's Composition Constant

Molteni’s Composition Constant

This essay continues where we left off in [1]: the number of (unordered) partitions of 2−1 as a sum of  powers of 2 is well-understood [2, 3, 4, 5, 6]. What can be said about the number () of (ordered) compositions of 2−1 as a sum of  powers of 2? Clearly (1) = (2) = 1; (3) = 3 since there are three ways to sort {1 1 2} and (4) = 13 since there are twelve ways to sort {1 1 2 4} p...

On the Composition of Baianced Incompiete Bidcic Designs

Some inequalities for the lower bound of the number of constraints in an orthogonal array of strength two are derived. A method of constructing balanced incomplete block designs is given which depends upon the existence of two such designs with the same block size. A large number of these designs with k c 4,5 and ~l are also given. Qualified requestors may obtain copies of this report from the ...

Coloured Petri Nets with Parallel Composition to Separate Concerns

We define a modeling language based on combining Coloured Petri Nets with Protocol Modeling semantics. This language combines the expressive power of Coloured Petri Nets in describing behavior with the ability provided by Protocol Modeling to compose partial behavioral descriptions. The resultant language can be considered as a domain specific Coloured Petri Net based language for deterministic...